Monte Carlo sampling for stochastic weight functions.

نویسندگان

  • Daan Frenkel
  • K Julian Schrenk
  • Stefano Martiniani
چکیده

Conventional Monte Carlo simulations are stochastic in the sense that the acceptance of a trial move is decided by comparing a computed acceptance probability with a random number, uniformly distributed between 0 and 1. Here, we consider the case that the weight determining the acceptance probability itself is fluctuating. This situation is common in many numerical studies. We show that it is possible to construct a rigorous Monte Carlo algorithm that visits points in state space with a probability proportional to their average weight. The same approach may have applications for certain classes of high-throughput experiments and the analysis of noisy datasets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monte Carlo techniques for real-time quantum dynamics

The stochastic-gauge representation is a method of mapping the equation of motion for the quantum mechanical density operator onto a set of equivalent stochastic differential equations. One of the stochastic variables is termed the “weight”, and its magnitude is related to the importance of the stochastic trajectory. We investigate the use of Monte Carlo algorithms to improve the sampling of th...

متن کامل

Malliavin Weight Sampling: A Practical Guide

Malliavin weight sampling (MWS) is a stochastic calculus technique for computing the derivatives of averaged system properties with respect to parameters in stochastic simulations, without perturbing the system’s dynamics. It applies to systems in or out of equilibrium, in steady state or time-dependent situations, and has applications in the calculation of response coefficients, parameter sens...

متن کامل

Combination of Approximation and Simulation Approaches for Distribution Functions in Stochastic Networks

This paper deals with the fundamental problem of estimating the distribution function (df) of the duration of the longest path in the stochastic activity network such as PERT network. First a technique is introduced to reduce variance in Conditional Monte Carlo Sampling (CMCS). Second, based on this technique a new procedure is developed for CMCS. Third, a combined approach of simulation and ap...

متن کامل

A New Form Factor Analogy and its Application to Stochastic Global Illumination Algorithms

A new form factor analogy, that has been derived from results of integral geometry, is introduced. The new analogy is shown to be useful for stochastic evaluation of the local form of the rendering equation used in various Monte Carlo methods for calculating global illumination. It makes it possible to improve importance sampling in these methods, thereby speeding up convergence. A new class of...

متن کامل

Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique

This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-stage stochastic linear programming problems with complete recourse. The algorithm uses sampling when the random variables are represented by continuous distribution functions. Traditionally, this method has been applied...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Proceedings of the National Academy of Sciences of the United States of America

دوره 114 27  شماره 

صفحات  -

تاریخ انتشار 2017